On Not Traveling

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ant Homing Ability Is Not Diminished When Traveling Backwards

Ants are known to be capable of homing to their nest after displacement to a novel location. This is widely assumed to involve some form of retinotopic matching between their current view and previously experienced views. One simple algorithm proposed to explain this behavior is continuous retinotopic alignment, in which the ant constantly adjusts its heading by rotating to minimize the pixel-w...

متن کامل

On Labeled Traveling Salesman Problems

We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum (or minimum) number of colors. We derive results regarding hardness of approximation, and analyze approximation algorithms for both versions of the problem. For the maximization version we give a 1 2 -approximation algorithm and show that it...

متن کامل

Traveling Waves on Lattice Dynamical Systems

We consider traveling wave solutions for nonlinear lattices of particles with nearest neighbour interaction. By using variational methods we prove the existence of monotone traveling waves for nite, periodic lattices and show that in the limit, as the period goes to innnity, these waves converge to corresponding solutions of the innnite lattice.

متن کامل

On the Discretized Dubins Traveling Salesman Problem

This research deals with a variation of the traveling salesman problem in which the cost of a tour, during which a kinematically constrained vehicle visits a set of targets, has to be minimized. We are motivated by scenarios that include motion planning for unmanned aerial, marine, and ground vehicles, just to name a few possible application outlets. We discretize the original continuous proble...

متن کامل

On the high multiplicity traveling salesman problem

This paper considers a version of the traveling salesman problem where the cities are to be visited multiple times. Each city has its own required number of visits. We investigate how the optimal solution and its objective value change when the numbers of visits are increased by a common multiplicator. In addition, we derive lower bounds on values of the multiplicator beyond which further incre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: PAJ: A Journal of Performance and Art

سال: 2021

ISSN: 1520-281X,1537-9477

DOI: 10.1162/pajj_a_00567